Storing Properties in Grouped Tagged Tuples

Probability of Mutually Commuting N-Tuples in Some Classes of Compact Groups

Adaptive Tuple Differential Coding

It is desirable to employ compression techniques in Relational OLAP systems to reduce disk space requirements and increase disk I/O throughput. Tuple Differential Coding (TDC) techniques have been introduced to compress views on a tuple level by storing only the differences between consecutive ordered tuples. These techniques work well for highly regular data in which the differences between tu...

A Dynamic Indexing for Incremental Entity Resolution over Query Results

Entity Resolution (ER) is the problem of identifying groups of tuples from one or multiple data sources that represent the same real-world entity. This is a crucial stage of data integration processes, which often need to integrate data at query time. This task becomes more challenging in scenarios with dynamic data sources or with a large volume of data. As most ER techniques deal with all tup...

Modal Logics in the Theory of Relational Databases

Logical formalisms for representing and reasoning about relational databases have been very popular. However, fragments of the standard rst-order logic used in most of these formalisms are quite inadequate for reasoning about properties represented by a set of tuples from a relation. In this short note, we propose a formalism for reasoning about these properties by means of two operators with r...

Compressing High - Dimensional Data Spaces Using Non - Differential Augmented Vector Quantization

Most data-intensive applications are confronted with the problems of I/O bottleneck, poor query processing times and space requirements. Database compression has been discovered to alleviate the I/O bottleneck, reduce disk space, improve disk access speed, speed up query, reduce overall retrieval time and increase the effective I/O bandwidth. However, random access to individual tuples in a com...